Packet Scheduling for Maximizing Revenue in a Network Node

نویسندگان

  • Jian Zhang
  • Timo Hämäläinen
  • Jyrki Joutsensalo
چکیده

In the future Internet, different applications such as Voice over IP (VoIP) and Video-on-Demand (VoD) arise with different demands on Quality of Service (QoS). Different kinds of service classes (e.g. gold, silver, bronze) should be supported in a network node. In the network node, packets are queued using a multiqueue system, where each queue corresponds to one service class. The customers of different classes will pay different prices to network providers based on multi-class pricing models. In this paper, we considered the optimization problem of maximizing the revenue attained in a network node under linear pricing scenario. A revenue-aware scheduling approach is introduced, which has the closed-form solution to the optimal weights for revenue maximization derived from revenue target function by Lagrangian optimization approach. The simulations demonstrate the revenue maximization ability of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...

متن کامل

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

متن کامل

بهبود پروتکل AODV جهت مقابله با حملات کرم‌چاله در شبکه‌های اقتضایی

Mobile Ad hoc Networks (MANET) are vulnerable to both active and passive attacks. The wormhole attack is one of the most severe security attacks in wireless ad hoc networks, an attack that can be mounted on a wide range of wireless network protocols without compromising any cryptographic quantity or network node.  In Wormhole attacks, one malicious node tunnels packets from its location to the ...

متن کامل

Delay Threshold-Based Priority Queueing Packet Scheduling for Integrated Services in Mobile Broadband Wireless Access System

In this paper, we present an opportunistic packet scheduling algorithm to support both real-time (RT) and non-real-time (NRT) services in mobile broadband wireless access (MBWA) systems. Our design objective is to determine the maximum number of RT and NRT users with respect to the overall service revenue while satisfying individual QoS requirements, e.g., the maximum allowable packet loss rate...

متن کامل

Network Parameters Evaluation in Vehicular Ad-hoc Network (VANET) Routing Protocols for Efficient Message Delivery in City Environment

Abstract- Efficient message delivery in city environment is required to ensure driver’s safety and passenger’s comfortability. In cities of developed nations, routing of data in vehicular Ad hoc Network (VANET) faces many challenges such as radio obstacles, mobility constraints and uneven nodes distribution. These factors primarily makes communication between vehicles complex. To overcome and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004